A Compression Algorithm for DNA Sequences Based on R2G Techniques with Security
نویسندگان
چکیده
منابع مشابه
An Optimal Seed Based Compression Algorithm for DNA Sequences
This paper proposes a seed based lossless compression algorithm to compress a DNA sequence which uses a substitution method that is similar to the LempelZiv compression scheme. The proposed method exploits the repetition structures that are inherent in DNA sequences by creating an offline dictionary which contains all such repeats along with the details of mismatches. By ensuring that only prom...
متن کاملHamming Distance Based Compression Techniques with Security
The proposed algorithm suggests a lossless data compression with security. Input Bit stream is divided into a group of 8-bits each .Encoder deviate the available Randomly generated key according to input bit stream which results into encrypted data. Encrypted key of 64-bits is treated as unit of 4-bits each. Each 4-bits of Key will be at the Hamming distance is of Two from Deviated key. There w...
متن کاملFast Discerning Repeats in DNA Sequences with a Compression Algorithm
Long direct repeats in genomes arise from molecular duplication mechanisms like retrotransposition, copy of genes, exon shu ing, . . . Their study in a given sequence reveals its internal repeat structure as well as part of its evolutionary history. Moreover, detailed knowledge about the mechanisms can be gained from a systematic investigation of repeats. The problem of nding such repeats is vi...
متن کاملa fast algorithm for exonic regions prediction in dna sequences
the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital sig...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in Bioinformatics
سال: 2015
ISSN: 1994-7941
DOI: 10.3923/tb.2015.93.98